Matching Modulo Associativity and Idempotency is NP-Complete
نویسندگان
چکیده
منابع مشابه
Matching Modulo Associativity and Idempotency Is NP-Complete
We show that AI–matching (AI denotes the theory of an associative and idempotent function symbol), which is solving matching word equations in free idempotent semigroups, is NP-complete. Note: this is a full version of the paper [9] and a revision of [8].
متن کاملLinear Higher-Order Matching Is NP-Complete
We consider the problem of higher-order matching restricted to the set of linear λ-terms (i.e., λ-terms where each abstraction λx.M is such that there is exactly one free occurrence of x in M). We prove that this problem is decidable by showing that it belongs to NP. Then we prove that this problem is in fact NP-complete. Finally, we discuss some heuristics for a practical algorithm.
متن کاملElastic image matching is NP-complete
One fundamental problem in image recognition is to establish the resemblance of two images. This can be done by searching the best pixel to pixel mapping taking into account monotonicity and continuity constraints. We show that this problem is NPcomplete by reduction from 3-SAT, thus giving evidence that the known exponential time algorithms are justified, but approximation algorithms or simpli...
متن کاملAugmenting a Geometric Matching is NP-complete
Given 2n points in the plane, it is well-known that there always exists a perfect straight-line non-crossing matching. We show that it is NP-complete to decide if a partial matching can be augmented to a perfect one, via a reduction from 1-in-3-SAT. This result also holds for bichromatic matchings. In a blitz chess tournament every player wants to play each round without pause and play against ...
متن کاملTheorem Proving modulo Associativity
We present an inference system for rst-order constrained clauses with equality modulo associativity (A). Our procedure is refutationally complete and reduces to Knuth-Bendix completion modulo A in the equational case. As an essential ingredient we present the rst |as far as we know| A-compatible reduction ordering total on the ground A-congruence classes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 2000
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v7i13.20140